Multi-Objective Multiagent Credit Assignment in NSGA-II Using Difference Evaluations

نویسندگان

  • Logan Michael Yliniemi
  • Drew Wilson
  • Kagan Tumer
چکیده

Determining the contribution of an agent to a system-level objective function (credit assignment) is a key area of research in cooperative multiagent systems. Multi-objective optimization is a growing area of research, though mostly focused on single agent settings. Many real-world problems are multiagent and multi-objective, (e.g., air traffic management, scheduling observations across multiple exploration robots) yet there is little work on their intersection. In this work, we leverage recent advances in single-objective multiagent learning to address multi-objective domains. We focus on the impact of difference evaluation functions (which extracts an agent’s contribution to the team objective) on the Non-dominated Sorting Genetic Algorithm-II (NSGA-II), a state-of-the-art multiobjective evolutionary algorithm. We derive multiple methods for incorporating difference evaluations into the NSGA-II framework, and test each in a multiagent rover exploration domain, which is a good surrogate for a wide variety of distributed scheduling and resource gathering problems. We show that how and where difference evaluations are incorporated in the NSGA-II algorithm is critical, and can either provide significant benefits or destroy system performance, depending on how it is used. Median performance of the correctly used difference evaluations dominates best-case performance of NSGA-II in a multiagent multi-objective problem.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Multi-objective multiagent credit assignment in reinforcement learning and NSGA-II

Multiagent systems have had a powerful impact on the real world. Many of the systems it studies (air traffic, satellite coordination, rover exploration) are inherently multi-objective, but they are often treated as single-objective problems within the research. A key concept within multiagent systems is that of credit assignment: quantifying an individual agent’s impact on the overall system pe...

متن کامل

Multi-objective Multiagent Credit Assignment Through Difference Rewards in Reinforcement Learning

Multiagent systems have had a powerful impact on the real world. Many of the systems it studies (air traffic, satellite coordination, rover exploration) are inherently multi-objective, but they are often treated as single-objective problems within the research. A very important concept within multiagent systems is that of credit assignment: clearly quantifying an individual agent’s impact on th...

متن کامل

Resonance assignment of the NMR spectra of disordered proteins using a multi-objective non-dominated sorting genetic algorithm.

A multi-objective genetic algorithm is introduced to predict the assignment of protein solid-state NMR (SSNMR) spectra with partial resonance overlap and missing peaks due to broad linewidths, molecular motion, and low sensitivity. This non-dominated sorting genetic algorithm II (NSGA-II) aims to identify all possible assignments that are consistent with the spectra and to compare the relative ...

متن کامل

A Replicator Dynamics Analysis of Difference Evaluation Functions

A key difficulty in Cooperative Coevolutionary Algorithms (CCEAs) is the credit assignment problem[1]. One solution to the credit assignment problem is the difference evaluation function, which produces excellent results in many multiagent domains. However, to date, there has been no prescriptive theoretical analysis deriving conditions under which difference evaluations improve the probability...

متن کامل

A dominance tree and its application in evolutionary multi-objective optimization

Most contemporary multi-objective evolutionary algorithms (MOEAs) store and handle a population with a linear list, and this may impose high computational complexities on the comparisons of solutions and the fitness assignment processes. This paper presents a data structure for storing the whole population and their dominating information in MOEAs. This structure, called a Dominance Tree (DT), ...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2015